Sufficient conditions for a digraph to admit a (1,? l)-identifying code
نویسندگان
چکیده
منابع مشابه
Sufficient Conditions for a Digraph to be Supereulerian
A (di)graph is supereulerian if it contains a spanning, connected, eulerian sub(di)graph. This property is a relaxation of hamiltonicity. Inspired by this analogy with hamiltonian cycles and by similar results in supereulerian graph theory, we give a number of sufficient Ore type conditions for a digraph to be supereulerian. Furthermore, we study the following conjecture due to Thomassé and the...
متن کاملSufficient conditions for a digraph to be Hamiltonian
We describe a new type of sufficient condition for a digraph to be Hamiltonian. Conditions of this type combine local structure of the digraph with conditions on the degrees of non-adjacent vertices. The main difference from earlier conditions is that we do not require a degree condition on all pairs of non-adjacent vertices. Our results generalize the classical conditions by Ghouila-Houri and ...
متن کاملSome sufficient conditions on Hamiltonian digraph
Z-mapping graph is a balanced bipartite graph G of a digraph D by split each vertex of D into a pair of vertices of G. Based on the property of the G, it is proved that if D is strong connected and G is Hamiltonian, then D is Hamiltonian. It is also proved if D is Hamiltonian, then G contains at least a perfect matching. Thus some existence sufficient conditions for Hamiltonian digraph and Hami...
متن کاملA New Sufficient Condition for a Digraph to Be Hamiltonian
In 2] the following extension of Meyniels theorem was conjectured: If D is a digraph on n vertices with the property that d(x) + d(y) 2n ? 1 for every pair of non-adjacent vertices x; y with a common out-neighbour or a common in-neighbour, then D is Hamiltonian. We verify the conjecture in the special case where we also require that minfd + (x)+d ? (y); d ? (x)+d + (y)g n ?1 for all pairs of ve...
متن کاملa new approach to credibility premium for zero-inflated poisson models for panel data
هدف اصلی از این تحقیق به دست آوردن و مقایسه حق بیمه باورمندی در مدل های شمارشی گزارش نشده برای داده های طولی می باشد. در این تحقیق حق بیمه های پبش گویی بر اساس توابع ضرر مربع خطا و نمایی محاسبه شده و با هم مقایسه می شود. تمایل به گرفتن پاداش و جایزه یکی از دلایل مهم برای گزارش ندادن تصادفات می باشد و افراد برای استفاده از تخفیف اغلب از گزارش تصادفات با هزینه پائین خودداری می کنند، در این تحقیق ...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2021
ISSN: ['1234-3099', '2083-5892']
DOI: https://doi.org/10.7151/dmgt.2218